Using Boolean Constraint Propagation for Sub-clauses Deduction
نویسندگان
چکیده
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boolean constraint propagation is proposed. It makes an original use of BCP to achieve further reduction of boolean formulas. Considering the implication graph generated by the constraint propagation process as a resolution tree, sub-clauses from the original formula can be deduced. Then, we show how such extension can be grafted to modern SAT solvers where BCP is maintained at each step of the search tree. Preliminary results of “Zchaff” the state of the art SAT solver augmented with extended BCP, show the great potential of our approach with respect to certain classes of SAT instances.
منابع مشابه
Vivifying Propositional Clausal Formulae
In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional and relevant clauses. More precisely, an incomplete redundancy check is performed on each original clauses through...
متن کاملA Generalized Two-watched-literal Scheme in a mixed Boolean and Non-linear Arithmetic Constraint Solver
In its combination with conflict-driven clause learning the two-watched-literal scheme led to enormous performance gains in propositional SAT solving. The idea of this approach is to accelerate the deduction phase of a SAT solver by saving a high number of unnecessary and expensive computation steps originating in visits of indefinite clauses. In this paper we give a detailed explanation of the...
متن کاملAn Effective Learnt Clause Minimization Approach for CDCL SAT Solvers
Learnt clauses in CDCL SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant literals may deteriorate both the effectiveness of Boolean constraint propagation and the quality of subsequent learnt clauses. To overcome this drawback, we define a new inprocessing SAT approach which eliminates redundant literals from learnt clauses by applyin...
متن کاملDon’t-Care Computation using k-clause Approximation
Computation of the satisfiability and observability care sets for a sub-circuit in a Boolean network is essentially a problem of quantifier elimination in propositional logic. In this paper, we introduce a method of approximate quantifier elimination that computes the strongest over-approximation expressible using clauses of a given length. The method uses a Boolean satisfiability solver in a m...
متن کاملTowards an Optimal CNF Encoding of Boolean Cardinality Constraints
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at least) k out of n propositional variables or formulae are true. We present a unifying framework for a whole family of such encodings encompassing previously proposed solutions. We give two novel encodings that improv...
متن کامل